Dynamic TCP Acknowledgment and Other Stories about e / ( e − 1 ) 1
نویسندگان
چکیده
We present the first optimal randomized online algorithms for the TCP acknowledgment problem [3] and the Bahncard problem [5]. These problems are well known to be generalizations of the classical online ski-rental problem, however, they appeared to be harder. In this paper we demonstrate that a number of online algorithms which have optimal competitive ratios of e/(e − 1), including these, are fundamentally no more complex than ski rental. Our results also suggest a clear paradigm for solving ski-rental-like problems.
منابع مشابه
Improved Selective Acknowledgment Scheme for TCP
A selective acknowledgment (SACK) mechanism, combined with a selective repeat retransmission policy, has been proposed to overcome the limitations with the cumulative acknowledgment scheme in TCP. With the SACK mechanism, the receiver informs the sender about the noncontiguous blocks of data that have been received and queued. However, for each such noncontiguous block, SACK requires 8 bytes to...
متن کاملHormozgan in the Nearchhos travelogue
Hormozgan province is located south of Iran, on the shore of Persian Gulf and Makran Sea. The shores of Persian Gulf have been a part of Hormozgan province since ancient times. Historical remains and archaeological findings of the province date back to 10000 year B.C.. Moreover, historical and geographical writings from 5th century B.C. also mention the shores of Persian Gulf. One of the o...
متن کاملCongestion and Corruption Loss Detection with Enhanced-TCP
In the Internet area, the Transmission Control Protocol (TCP) is the most commonly used transport protocol. In this paper, we present how TCP is tuned to differentiate between corruption and congestion losses. We also discuss why regular TCP is not suitable for mobile hosts and its inability to detect the type of losses that yield significant degradation of TCP performance. We introduce an Enha...
متن کاملTCP Dynamic Acknowledgment Delay: Theory and Practice
We study an on-line problem that is motivated by the networking problem of dynamically adjusting delays of acknowledgments in the Transmission Control Protocol (TCP). The theoretical problem we study is the following. There is a sequence of n packet arrival times A = and a look-ahead coefficient L. The goal is to partition A into k subsequences sigma1, sigma2, ...,sigmak (where a subsequence en...
متن کاملThe Impact of Delayed Acknowledgement on E-TCP Performance In Wireless networks
The expansion of Internet into wireless network has been a very active area of research. One of the topics many researches focus on is the performance of TCP over wireless environment. TCP is an Internet transport protocol, which uses a cumulative acknowledgement strategy to adjust its transmission rate. In this paper we investigate the impact of two acknowledgement strategies employed by recei...
متن کامل